Chords halving the area of a planar convex set
نویسندگان
چکیده
منابع مشابه
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between p and q and their Euclidean distance. The supremum over all pairs of points of all these ratios is called the geometric dilation of G. Our research is motivated by the problem of designing graphs of low dilation. We ...
متن کاملComputing the convex hull of a planar point set
In Figure 1, the set S consists of thirteen points. The output of a convex hull algorithm should be the list (p1, p2, p3, p4, p5, p6). We remark that the list storing the vertices of CH (S) can start with an arbitrary vertex. In the example, the list (p3, p4, p5, p6, p1, p2) would also be a valid output. ∗School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6. E-mail: ...
متن کاملOn the convex layers of a planar set
Let S be a set of n points in the Euclidean plane. The convex layers of S are the convex polygons obtained by iterating on the following procedure: compute the convex hull of S and remove its vertices from S. This process of peeling a planar point set is central in the study of robust estimators in statistics. It also provides valuable information on the morphology of a set of sites and has pro...
متن کاملOn the Rectilinear Convex Layers of a Planar Set
In this paper we give an optimal O(n log n) time and O(n) space algorithm to compute the rectilinear convex layers of a set S of n points on the plane. We also compute the rotation of S that minimizes the number of rectilinear convex layers in O(n log n) time and O(n) space.
متن کاملOn the maximum area pentagon in a planar point set
A finite set of points in the plane is described as in convex position if it forms the set of vertices of a convex polygon. This work studies the ratio between the maximum area of convex heptagons with vertices in P and the area of the convex hull of P, where the planar point set P is in convex position.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Inequalities & Applications
سال: 2007
ISSN: 1331-4343
DOI: 10.7153/mia-10-17